Masaryk University Faculty of Science Constrained Rewrite Transition Systems

We extend broadly studied rewrite transition systems with the mechanism for computing with partial information in the form similar to the one used in concurrent constraint programming. Two new classes of transition systems (fcBPA and fcBPP) are introduced as this extension changes expressibility power of rewrite transition systems corresponding to BPA and BPP. The power of rewrite systems corresponding to other classes (FSA, PDA, PPDA, and PN) keeps unchanged. The new classes are inserted to the hierarchy of standard process classes presented by Moller [Mol96].